parameterized problem

Definition

A parameterized problem is a language $L \subseteq \Sigma^* \times \mathbb{N}$, where $\Sigma$ is a finite, fixed alphabet. For an instance $(x,k) \in \Sigma^* \times \mathbb{N}$, refer to $k$ as the parameter.

References

1. https://courses.cs.cornell.edu/cs6810/2023fa/Parameterized.pdf